Toward Approximate Moving Least Squares Approximation with Irregularly Spaced Centers
نویسنده
چکیده
By combining the well known moving least squares approximation method and the theory of approximate approximations due to Maz’ya and Schmidt we are able to present an approximate moving least squares method which inherits the simplicity of Shepard’s method along with the accuracy of higher-order moving least squares approximations. In this paper we focus our interest on practical implementations for irregularly spaced data sites. The two schemes described here along with some first numerical experiments are to be viewed as exploratory work only. These schemes apply to centers that are obtained from gridded centers via a smooth parametrization. Further work to find a robust numerical scheme applicable to arbitrary scattered data is needed.
منابع مشابه
A meshless discrete Galerkin method for solving the universe evolution differential equations based on the moving least squares approximation
In terms of observational data, there are some problems in the standard Big Bang cosmological model. Inflation era, early accelerated phase of the evolution of the universe, can successfully solve these problems. The inflation epoch can be explained by scalar inflaton field. The evolution of this field is presented by a non-linear differential equation. This equation is considered in FLRW model...
متن کاملIterated Approximate Moving Least Squares Approximation
The radial basis function interpolant is known to be the best approximation to a set of scattered data when the error is measured in the native space norm. The approximate moving least squares method, on the other hand, was recently proposed as an efficient approximation method that avoids the solution of the system of linear equations associated with the radial basis function interpolant. In t...
متن کاملRecent Results for Moving Least Squares Approximation
We describe two experiments recently conducted with the approximate moving least squares (MLS) approximation method. On the one hand, the NFFT library of Kunis, Potts, and Steidl is coupled with the approximate MLS method to obtain a fast and accurate multivariate approximation method. The second experiment uses approximate MLS approximation in combination with a multilevel approximation algori...
متن کاملApproximate likelihood for large irregularly spaced spatial data1
Likelihood approaches for large irregularly spaced spatial datasets are often very difficult, if not infeasible, to use due to computational limitations. Even when we can assume normality, exact calculations of the likelihood for a Gaussian spatial process observed at n locations requires O(n) operations. We present a version of Whittle’s approximation to the Gaussian log likelihood for spatial...
متن کاملExact and approximate solutions of fuzzy LR linear systems: New algorithms using a least squares model and the ABS approach
We present a methodology for characterization and an approach for computing the solutions of fuzzy linear systems with LR fuzzy variables. As solutions, notions of exact and approximate solutions are considered. We transform the fuzzy linear system into a corresponding linear crisp system and a constrained least squares problem. If the corresponding crisp system is incompatible, then the fuzzy ...
متن کامل